The Černý conjecture for one-cluster automata with prime length cycle
نویسنده
چکیده
We prove the Černý conjecture for one-cluster automata with prime length cycle. Consequences are given for the hybrid Roadcoloring-Černý conjecture for digraphs with a proper cycle of prime length.
منابع مشابه
The Cerny Conjecture for Automata with Blocking States
In [7], Jan Černý conjectured that an arbitrary directable automaton with n states has a directing word of length not longer than (n−1). This conjecture is one of the most longstanding open problems in the theory of finite automata. Most of papers dealing with this conjecture reduce the problem to special classes of automata. In present paper we deal with this conjecture in the class of automat...
متن کاملOn Carpi and Alessandro conjecture
The well known open Černý conjecture states that each synchronizing automaton with n states has a synchronizing word of length at most (n−1) . On the other hand, the best known upper bound is cubic of n. Recently, in the paper [1] of Alessandro and Carpi, the authors introduced the new notion of strongly transitivity for automata and conjectured that this property with a help of Extension metho...
متن کاملThe Černý Conjecture for Aperiodic Automata
A word w is called a synchronizing (recurrent, reset, directable) word of a deterministic finite automaton (DFA) if w brings all states of the automaton to some specific state; a DFA that has a synchronizing word is said to be synchronizable. Černý conjectured in 1964 that every n-state synchronizable DFA possesses a synchronizing word of length at most (n−1). We consider automata with aperiodi...
متن کاملExponent Sequences of Labeled Digraphs vs Reset Thresholds of Synchronizing Automata
A DFA A = 〈Q,Σ〉 is called synchronizing if the action of some word w ∈ Σ∗ resets A , that is, leaves the automaton in one particular state no matter at which state in Q it is applied: q ·w = q′ ·w for all q, q′ ∈ Q. Any such word w is said to be a reset word for the DFA. The minimum length of reset words for A is called the reset threshold of A . In 1964 Černý [2] constructed for each n > 1 a s...
متن کاملThe Černý Conjecture and 1-Contracting Automata
A deterministic finite automaton is synchronizing if there exists a word that sends all states of the automaton to the same state. Černý conjectured in 1964 that a synchronizing automaton with n states has a synchronizing word of length at most (n− 1)2. We introduce the notion of aperiodically 1-contracting automata and prove that in these automata all subsets of the state set are reachable, so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 412 شماره
صفحات -
تاریخ انتشار 2011